Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
نویسندگان
چکیده
منابع مشابه
Minimum Delay Routing in Multihop Wireless Networks
End-to-end delay is an important QoS metric in multihop wireless networks such as sensor networks and mesh networks. Along with throughput, end-to-end delay determines the user-experienced data transmission time. End-to-end delay refers to the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the route and the interference l...
متن کاملMinimum Delay Routing in Multisatellite Networks†
We consider the problem of traveling with least expected delay in networks whose link delays change probabilistically according to Markov chains. This is a typical routing problem in dynamic multisatellite networks. We formulate several optimization problems, posed on infinite and finite horizons, and consider them with and without using memory in the decision making process. We prove that all ...
متن کاملA practical framework for minimum-delay routing in computer networks
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with this type of routing are far from optimal. Furthermore, if link costs are associated with delays, ...
متن کاملDistributed Routing Algorithms for Sensor Networks
Recent advances in wireless communications and computing technology are enabling the emergence of low-cost devices that incorporate sensing, processing, and communication functionalities. A large number of these devices are deployed in the field to create a sensor network for both monitoring and control purposes. Sensor networks are currently an active research area mainly due to the potential ...
متن کاملDistributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting
In this article, we investigate two different distributed algorithms for constructing a minimum power broadcast tree with a maximum depth ∆ which corresponds to the maximum tolerable end-to-end delay in the network. Distributed Tree Expansion (DTE) is based on an implementation of a distributed minimum spanning tree algorithm in which the tree grows at each iteration by adding a node that can c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1984
ISSN: 0096-2244
DOI: 10.1109/tcom.1984.1096159